Estimating error bounds for binary subdivision curves/surfaces
نویسندگان
چکیده
We estimate error bounds between binary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parameterizations therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as curve/surface intersection, mesh generation, NC machining, surface rendering and so on. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Estimating Error Bounds for Ternary Subdivision Curves / Surfaces
We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Our technique is independent of parametriza...
متن کاملSubdivision Curves on Surfaces and Applications
Subdivision curves have great importance for many CAD/CAM applications. In this paper we propose a simple method to define subdivision schemes on triangulations. It works by translating to the triangulation a perturbation of a planar binary subdivision. To reproduce this perturbation in the surface we use both, shortest and straightest geodesics, so we call this strategy intrinsic projection me...
متن کاملThe Mask of Odd Points n-Ary Interpolating Subdivision Scheme
We present an explicit formula for the mask of odd points n-ary, for any odd n 3, interpolating subdivision schemes. This formula provides the mask of lower and higher arity schemes. The 3-point and 5-point a-ary schemes introduced by Lian, 2008, and 2m 1 -point a-ary schemes introduced by, Lian, 2009, are special cases of our explicit formula. Moreover, other well-known existing odd point n-ar...
متن کاملAdaptive Subdivision Curves and Surfaces
Well-known schemes of subdivision curves and surfaces are modified so that they allow an adaptive refinement. Adaptation is controlled by an error measure which indicates for the vertices of a mesh whether the approximation is sufficient. The adaptive constructions are based on local operations of refining or coarsening. They allow to reach all other subdivisions, in particular the non-adaptive...
متن کاملError bounds for a class of subdivision schemes based on the two-scale refinement equation
Subdivision schemes are iterative procedures to construct curves and constitute fundamental tools in Computer Aided Design. Starting with an initial control polygon, a subdivision scheme refines the computed values at the previous step according to some basic rules. The scheme is said to be convergent if there exists a limit curve. The computed values define a control polygon in each step. This...
متن کامل